# -*- coding: utf-8 -*-
# @Time : 2023/10/23 21:05
# @Author : ZH
# @File : 39.py
# @Software: PyCharm
import bisect
from typing import List

class Solution:
    def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]:
        sort_list = sorted(candidates)
        index = bisect.bisect_left(sort_list, target)
        if index == 0:
            return []
        need_list = sort_list[:index+1]

        pass

